Exact value of 3 color weak Rado number

نویسندگان

  • Maria Pastora Revuelta Marchena
  • Luis Boza
  • Juan Manuel Marín
  • María Isabel Sanz Domínguez
چکیده

For integers k, n, c with k, n ≥ 1 and c ≥ 0, the n color weak Rado number WRk(n, c) is defined as the least integer N , if it exists, such that for every ncoloring of the set {1, 2, ..., N}, there exists a monochromatic solution in that set to the equation x1 + x2 + ... + xk + c = xk+1, such that xi ̸= xj when i ̸= j. If no such N exists, then WRk(n, c) is defined as infinite. In this work, we consider the main issue regarding the 3 color weak Rado number for the equation x1 + x2 + c = x3 and the exact value of the WR2(3, c) = 13c+ 22 is established.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On some Rado numbers for generalized arithmetic progressions

The 2-color Rado number for the equation x1 + x2 − 2x3 = c, which for each constant c ∈ Z we denote by S1(c), is the least integer, if it exists, such that every 2-coloring, ∆ : [1, S1(c)]→ {0, 1}, of the natural numbers admits a monochromatic solution to x1 +x2−2x3 = c, and otherwise S1(c) = ∞. We determine the 2-color Rado number for the equation x1 + x2 − 2x3 = c, when additional inequality ...

متن کامل

ar X iv : m at h / 06 06 45 1 v 1 [ m at h . C O ] 1 9 Ju n 20 06 TWO COLOR OFF - DIAGONAL RADO - TYPE NUMBERS

We show that for any two linear homogenous equations E0, E1, each with at least three variables and coefficients not all the same sign, any 2-coloring of Z+ admits monochromatic solutions of color 0 to E0 or monochromatic solutions of color 1 to E1. We define the 2-color off-diagonal Rado number RR(E0, E1) to be the smallest N such that [1, N ] must admit such solutions. We determine a lower bo...

متن کامل

Computing the Uncomputable Rado Sigma Function An Automated, Symbolic Induction Prover for Nonhalting Turing Machines

It is a classic result of computability theory that there exist uncomputable functions. A prime example is Tibor Rado’s [1] function SHnL (or the busy beaver function) that measures the productivity of n-state, binary Turing machines. Despite being uncomputable, we know [2] exact values of SHnL for n = 1, 2, 3, 4 and a high lower bound for n = 5: SH5L ¥ 4098 [3]. To compute the exact value of S...

متن کامل

Fuzzy Number-Valued Fuzzy Graph

Graph theory has an important role in the area of applications of networks and clustering‎. ‎In the case of dealing with uncertain data‎, ‎we must utilize ambiguous data such as fuzzy value‎, ‎fuzzy interval value or values of fuzzy number‎. ‎In this study‎, ‎values of fuzzy number were used‎. ‎Initially‎, ‎we utilized the fuzzy number value fuzzy relation and then proposed fuzzy number-value f...

متن کامل

Partitions of large Rado graphs

Let κ be a cardinal which is measurable after generically adding iκ+ω many Cohen subsets to κ and let G = (κ,E) be the κ-Rado graph. We prove, for 2 ≤ m < ω, that there is a finite value r m such that the set [κ] can be partitioned into classes ̇ Ci : i < r + m ̧ such that for any coloring of any of the classes Ci in fewer than κ colors, there is a copy G∗ of G in G such that [G∗]m ∩ Ci is monoch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2016